Minimum-error classes for matching parts

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colorimetric matching by minimum-square-error fitting.

Least-squares approximation can be used in image-based colorimetry once the set of sampling functions is selected. We discuss the accuracy obtained in earlier research, and we compare it with a better calculation method.

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Parts, classes and Parts of Classes: an anti-realist reading of Lewisian mereology

This study is in two parts. In the first part, various important principles of classical extensional mereology are derived on the basis of a nice axiomatization involving ‘part of’ and fusion. All results are proved here with full Fregean (and Gentzenian) rigor. They are chosen because they are needed for the second part. In the second part, this natural-deduction framework is used in order to ...

متن کامل

Region Matching with Missing Parts

We present a variational approach to the problem of registering planar shapes despite missing parts. Registration is achieved through the evolution of a partial differential equation that simultaneously estimates the shape of the missing region, the underlying “complete shape” and the collection of group elements (Euclidean or affine) corresponding to the registration. Our technique applies bot...

متن کامل

Computational Error Complexity Classes

The complexity classes Nearly-BPP and Med DisP had been recently proposed as limits of eecient computation Yam1 96, Schi 96]. For both classes, a polynomial time bounded algorithm with bounded probabilistic error has to compute correct outputs for at least 1 ? 1 n !(1) of inputs of length n. We generalize this notion to general error probabilities and arbitrary complexity classes. For proving t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2021

ISSN: 0167-6377

DOI: 10.1016/j.orl.2020.12.003